A Fast Pattern Matching Algorithm with Two Sliding Windows (TSW)
نویسندگان
چکیده
منابع مشابه
A FAST Pattern Matching Algorithm
The advent of digital computers has made the routine use of pattern-matching possible in various applications. This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far. The new algorithm has been evolved after analyzing the well-known algorithms such as Boyer-Moore,...
متن کاملA Fast Multiple String-pattern Matching Algorithm
In this paper, we propose a simple but eecient multiple string pattern matching algorithm based on a compact encoding scheme. This algorithm scans text from left to right while encoding characters in the text based on the alphabet that occurs in the input patterns. The simple scanning algorithm demonstrates the ability to handle a very large number of input patterns simultaneously. Our experime...
متن کاملA Simple Fast Hybrid Pattern-Matching Algorithm
The Knuth–Morris–Pratt (KMP) pattern-matching algorithm guarantees both independence from alphabet size and worst-case execution time linear in the pattern length; on the other hand, the Boyer–Moore (BM) algorithm provides near-optimal average-case and best-case behaviour, as well as executing very fast in practice. We describe a simple algorithm that employs the main ideas of KMP and BM (with ...
متن کاملFast Two-Dimensional Pattern Matching
An algorithm for searching for a two dimensional m m pattern in a two dimensional n n text is presented. It performs on the average less comparisons than the size of the text: n 2 =m using m 2 extra space. Basically, it uses multiple string matching on only n=m rows of the text. It runs in at most 2n 2 time and is close to the optimal n 2 time for many patterns. It steadily extends to an alphab...
متن کاملFast low-level pattern matching algorithm
This paper focuses on pattern matching in the DNA sequence. It was inspired by a previously reported method that proposes encoding both pattern and sequence using prime numbers. Although fast, the method is limited to rather small pattern lengths, due to computing precision problem. Our approach successfully deals with large patterns, due to our implementation that uses modular arithmetic. In o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2008
ISSN: 1549-3636
DOI: 10.3844/jcssp.2008.393.401